The orienteering problem with stochastic profits
نویسندگان
چکیده
Given a graph G = (N, E), N representing the set of nodes associated with Normally distributed random profits and E representing the set of edges with associated travel times, we define the Orienteering Problem with Stochastic Profits (OPSP) as the problem of finding a tour that visits a subset of N within a prespecified time limit and maximizes the probability of collecting more than a prespecified target profit level. We develop an exact solution scheme based on a parametric formulation of the problem and present a bi-objective genetic algorithm. We also analyze the characteristics of the problem and test the algorithms computationally. The experimental results identify conditions under which the OPSP results in significant improvements in reaching the target profit when compared with the solution from the deterministic variant of the problem.
منابع مشابه
Orienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs
Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’s satisfaction and maximize profits. In this paper, the orienteering problem with variable profits, fractional objective func...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملApproximation Algorithms for P2P Orienteering and Stochastic Vehicle Routing Problem
We consider the P2P orienteering problem on general metrics and present a (2+ε) approximation algorithm. In the stochastic P2P orienteering problem we are given a metric and each node has a fixed reward and random size. The goal is to devise a strategy for visiting the nodes so as to maximize the expected value of the reward without violating the budget constraints. We present an approximation ...
متن کاملThe orienteering problem with variable profits
This paper introduces, models and solves a generalization of the Orienteering Problem, called the The Orienteering Problem with Variable Profits (OPVP). The OPVP is defined on a complete undirected graph G = (V,E), with a depot at vertex 0. Every vertex i ∈ V \ {0} has a profit pi to be collected, and an associated collection parameter αi ∈ [0, 1]. The vehicle may make a number of “passes”, col...
متن کاملTeam Orienteering Problem with Decreasing Profits
Team Orienteering with Decreasing Profits (DP-TOP) extends the classical Team Orienteering problem (TOP) by considering the profit of each client as a decreasing function of time. It consists of maximizing the sum of collected profit by a fixed number K of vehicles, visiting each client at most once. In this work, we present lower bounds based on a Dantzig-Wolfe decomposition and column generat...
متن کامل